Jinu GONG Hoojin LEE Joonhyuk KANG
In this letter, we present a new expression of ergodic capacity for two-wave with diffuse power (TWDP) fading channels. The derived formula is relatively concise and consists of well-known functions even in infinite series form. Especially, the truncated approximate expression and asymptotic formula are also presented, which enable us to obtain useful and physical insights on the effect of TWDP fading on the ergodic capacity for various fading conditions.
Donggu KIM Hoojin LEE Joonhyuk KANG
To effectively analyze the influence of two-wave with diffuse power (TWDP) fading on the achievable error rate performance of binary phase-shift keying (BPSK) signaling, we derive two novel concise asymptotic closed-form bit error rate (BER) formulas. We perform asymptotic analysese based on existing exact and approximate BER formulas, which are obtained from the exact probability density function (PDF) or moment generating function (MGF), and the approximate PDF of TWDP fading. The derived asymptotic closed-form expressions yield explicit insights into the achievable error rate performance in TWDP fading environments. Furthermore, the absolute relative error (ARE) between the exact and approximate coding gains is investigated, from which we also propose a criterion for the order of an approximate PDF, which is more robust than the conventional criterion. Numerical results clearly demonstrate the accuracy of the derived asymptotic formulas, and also support our proposed criterion.
Chanho YOON Hoojin LEE Joonhyuk KANG
A new approach for encoding one class of quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed. The proposed encoding method is applicable to parity-check matrices having dual-diagonal parity structure with single column of weight three in the parity generation region. Instead of finding the parity bits directly, the proposed method finds parity bits through vector correction. While the proposed LDPC encoding scheme is readily applicable to matrices defined in the IEEE physical layer standards, the computational complexity of the post processing operation for extraction of correction vector requires less effort than solving the linear equations involved with finding the parity bit as proposed by Myung et al.
We present a computationally efficient sequential detection scheme using a modified Fano algorithm (MFA) for V-BLAST systems. The proposed algorithm consists of the following three steps: initialization, tree searching, and optimal selection. In the first step, the proposed detection scheme chooses several candidate symbols at the tree level of one. Based on these symbols, the MFA then finds the remaining transmitted symbols from the second tree level in the original tree structure. Finally, an optimal symbol sequence is decided among the most likely candidate sequences searched in the previous step. Computer simulation shows that the proposed scheme yields significant saving in complexity with very small performance degradation compared with that of sphere detection (SD).
Jaekwon KIM Joonhyuk KANG Yongsoo CHO
When a fixed free-running crystal is used for sampling time generation at a DMT receiver, Inter-Symbol Interference (ISI) and Inter-Carrier Interference (ICI) are introduced by sampling time error. The ICI becomes more serious as the DMT symbol length increases. In this letter, the effects of sampling clock offset are investigated in the time domain using a new notion of Inter-sample Interference (IsI) instead of ISI and ICI. Based on the IsI analysis, we propose a new frequency domain timing error correction scheme.
Namjeong LEE Hoojin LEE Joonhyuk KANG Gye-Tae GIL
In this letter, we propose a computationally effient equalization technique that employs block minimum mean squared error (MMSE) depending on LDLH factorization. Parallel interference cancellation (PIC) is executed with pre- obtained output to provide more reliable symbol detection. In particular, the band structure of the frequency domain channel matrix is exploited to reduce the implementation complexity. It is shown through computer simulation that the proposed technique requires lower complexity than the conventional algorithm to obtain the same performance, and that it exhibits better performance than the conventional counterpart when the same complexity is assumed.